#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

int n, a, b, t = 0, p;
int r[500001];
int i, j;
bool cmp(int a, int b)
{
    return a > b;
}
int main()
{
    scanf("%d%d%d", &n, &a, &b);
    for (i = 1; i <= n; i++)
    {
        scanf("%d", &r[i]);
    }
    sort(r + 1, r + 1 + n, cmp);
    while (true)
    {
        if (r[1] <= t * a)
            break;
        r[1] -= b;
        p = r[1];
        for (j = 2; r[j] > p && j <= n; j++)
        {
            r[j - 1] = r[j];
        }
        r[j - 1] = p;
        t++;
    }
    printf("%d", t);
    return 0;
}